Optimal Point Set Partitioning using Rigid Motion Star Placement
نویسندگان
چکیده
We consider the problem of determining the placement of a star R on a set P of n points in the plane such that a given objective function is maximized. A star R is a set of m rays {r1, . . . , rm} in R, emanating from a point p such that the angle between two consecutive rays is 2π m . A cone defined by two consecutive rays is c-occupied if it contains at least c points of P. Our main result is an O(nm) expected time (and O(nm log nm) deterministic time) algorithm to find the rigid motion placement of R that maximizes the number of c-occupied cones. We then show how this technique can be extended to solve several other optimization problems.
منابع مشابه
Planning and Control of Two-Link Rigid Flexible Manipulators in Dynamic Object Manipulation Missions
This research focuses on proposing an optimal trajectory planning and control method of two link rigid-flexible manipulators (TLRFM) for Dynamic Object Manipulation (DOM) missions. For the first time, achievement of DOM task using a rotating one flexible link robot was taken into account in [20]. The authors do not aim to contribute on either trajectory tracking or vibration control of the End-...
متن کاملOptimal Polygon Placement
Given a simple polygon P with m vertices and a set S of n points in the plane, we consider the problem of finding a rigid motion placement of P that contains the maximum number of points in S. We present two solutions to this problem that represent time versus space tradeoffs. The first algorithm runs in O(n3m3) expected time using O(n2m2) space. The second algorithm runs in O(n3m3 log(nm)) det...
متن کاملOptimality conditions for Pareto efficiency and proper ideal point in set-valued nonsmooth vector optimization using contingent cone
In this paper, we first present a new important property for Bouligand tangent cone (contingent cone) of a star-shaped set. We then establish optimality conditions for Pareto minima and proper ideal efficiencies in nonsmooth vector optimization problems by means of Bouligand tangent cone of image set, where the objective is generalized cone convex set-valued map, in general real normed spaces.
متن کاملOptimizing Robot Placement for Visit-Point Tasks
We present a manipulator placement algorithm for minimizing the length of the manipulator motion performing a visit-point task such as spot welding. Given a set of points for the tool of a manipulator to visit, our algorithm finds the shortest robot motion required to visit the points from each possible base configuration. The base configuration resulting in the shortest motion is selected as t...
متن کاملNumerical Analysis of Composite Beams under Impact by a Rigid Particle
Analysis of a laminated composite beam under impact by a rigid particle is investigated. The importance of this project is to simulate the impact of objects on small scale aerial structures. The stresses are considered uni- axial bending with no torsion loading. The first order shear deformation theory is used to simulate the beam. After obtaining kinematic and potential energy for a laminated ...
متن کامل